Three-line chromatic indices of Steiner triple systems

نویسندگان

  • Mike J. Grannell
  • Terry S. Griggs
  • Alexander Rosa
چکیده

There are five possible structures for a set of three lines of a Steiner triple system. Each of these three-line "configurations" gives rise to a colouring problem in which a partition of all the lines of an STS( v) is sought, the components of the partition each having the property of not containing any copy of the configuration in question. For a three-line configuration B, and STS ( v) S, the minimum number of classes required is denoted by X(B, S) and is called the B-chromatic index of S. This generalises the ordinary chromatic index X'(S) and the 2-parallel chromatic index X" (S). (For the latter see [7].) In this paper we obtain results concerning X(B, v) = min{x(B, S) : S is an STS(v)} for four of the five three-line configurations B. In three of the cases we give precise values for all sufficiently large v and in the fourth case we give an asymptotic result. The values of the four chromatic indices for v ::; 13 are also determined.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Circulants and the Chromatic Index of Steiner Triple Systems

We complete the determination of the chromatic number of 6valent circulants of the form C(n; a, b, a+b) and show how this can be applied to improving the upper bound on the chromatic index of cyclic Steiner triple systems.

متن کامل

The chromatic index of block intersection graphs of Kirkman triple systems and cyclic Steiner triple systems

The block intersection graph of a combinatorial design with block set B is the graph with B as its vertex set such that two vertices are adjacent if and only if their associated blocks are not disjoint. The chromatic index of a graph G is the least number of colours that enable each edge of G to be assigned a single colour such that adjacent edges never have the same colour. A graph G for which...

متن کامل

Caps and Colouring Steiner Triple Systems

Hill [6] showed that the largest cap in PG(5, 3) has cardinality 56. Using this cap it is easy to construct a cap of cardinality 45 in AG(5, 3). Here we show that the size of a cap in AG(5, 3) is bounded above by 48. We also give an example of three disjoint 45-caps in AG(5, 3). Using these two results we are able to prove that the Steiner triple system AG(5, 3) is 6-chromatic, and so we exhibi...

متن کامل

The triangle chromatic index of Steiner triple systems

In a Steiner triple system of order v, STS(v), a set of three lines intersecting pairwise in three distinct points is called a triangle. A set of lines containing no triangle is called triangle-free. The minimum number of triangle-free sets required to partition the lines of a Steiner triple system S, is called the triangle chromatic index of S. We prove that for all admissible v, there exists ...

متن کامل

Star chromatic numbers of hypergraphs and partial Steiner triple systems

The concept of star chromatic number of a graph, introduced by Vince (1988) is a natural generalization of the chromatic number of a graph. This concept was studied from a pure combinatorial point of view by Bondy and Hell (1990). In this paper we introduce strong and weak star chromatic numbers of uniform hypergraphs and study their basic properties. In particular, we focus on partial Steiner ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Australasian J. Combinatorics

دوره 21  شماره 

صفحات  -

تاریخ انتشار 2000